Obstructions to weak decomposability for simplicial polytopes
نویسندگان
چکیده
منابع مشابه
Obstructions to Weak Decomposability for Simplicial Polytopes
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee provided the first examples of simplicial polytopes that are not weakly vertex-decomposable. These polytopes are polar to certain simple transportation poly...
متن کاملDecomposability of Polytopes
We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We apply it to give new sufficient conditions for indecomposability of polytopes, and then illustrate them with some examples.
متن کاملConstructions and obstructions for extremal polytopes
In the fall of 2001, I was finishing my computer science undergrad studies and Martin Skutella suggested that I take the course " Linear optimization " , a course offered to beginning math grad students and taught by Prof. Günter Ziegler. Following his advice, my fellow student Roman Wagner and I took the course, and failed badly. We lacked the necessary linear algebra and so the teaching assis...
متن کاملTriangulations of Simplicial Polytopes
Various facts about triangulations of simplicial polytopes, particularly those pertaining to the equality case in the generalized lower bound conjecture, are collected together here. They include an apparently weaker restriction on the kind of triangulation which needs to be found, and an inductive argument which reduces the number of cases to be established.
متن کاملUnique Minimal Liftings for Simplicial Polytopes
For a minimal inequality derived from a maximal lattice-free simplicial polytope in R, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers R. We then use this characterization to show that a minimal inequality derived from a maximal lattice-free simplex in R with exactly one lattice point in the relative interior of each facet has a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2014
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2014-12101-0